| |
| description |
The proliferation of mobile devices and the fact that high-bandwidth
connectivity is not available everywhere, has led to the development
of hoarding algorithms. The aim of these algorithms is to select and
prefetch data, mobile users might access when they are weakly
connected in the future. The data is selected based on context
information of users, such as their location. In this paper, we
present a hoarding approach for semi-structured information items
and introduce our Bounded Path Search algorithm (BPS) for the
computation of the hoard list. We show by means of experimental
evaluation that BPS outperforms existing hoarding techniques that
use standard graph search algorithms by a factor of 2.7 in terms of
hoard cache hit ratio.
|
| publisher |
University of Stuttgart : Collaborative Research Center SFB 627
(Nexus: World Models for Mobile Context-Based
Systems)
|
| Springer-Verlag
|
| type |
Text
|
| Article in Proceedings
|
| source |
In: Proceedings of the Second Workshop on Context Awareness for
Proactive Systems (CAPS 2006), pp. 1-11
|
| contributor |
Institut für Parallele und Verteilte Systeme, Verteilte
Systeme
|
| subject |
Information Storage and Retrieval (CR H.3)
|
| Hoarding
|
| location-based systems
|
| relation |
Lecture Notes in Computer Science
|